The Bi-objective Long-haul Transportation Problem on a Road Network

In this paper we study a long-haul truck scheduling problem where path has to be determined for vehicle traveling from specified origin destination. We consider refueling decisions along the path, while accounting heterogeneous fuel prices in road network. Furthermore, comply with Hours of Service (HoS) regulations. Therefore, is defined by actual trajectory traveled vehicle, as well locations stops due refueling, compliance HoS regulations, or combination two. This setting cast bi-objective optimization problem, considering minimization cost and duration. An algorithm proposed solve on The builds set non-dominated paths respect two objectives. Given enormous theoretical size network, follows an interactive construction mechanism. Specifically, dynamically interacts geographic information system identify relevant potential stop locations. Computational tests are made real-sized instances distance covered ranges 500 1500 km. compared solutions obtained policy mimicking current practice logistics company. results show that produced significantly dominate ones generated practice, terms costs, achieving similar durations. average number 2.7, which allows decision makers ultimately visually inspect alternatives.